A shallow embedding of Z in HOL
نویسندگان
چکیده
A simple ‘shallow’ semantic embedding of the Z notation into the higher order logic, as supported by the HOL theorem proving system, is presented. Z is is typically used for human-readable formal specification whereas HOL is used for machine-checked verification. The paper is intended to show how a tool such as HOL can be used to provide mechanical support for Z, including mechanization of proofs. No specialized knowledge of Z or HOL is assumed. An explanation of shallow and deep embedding as well as a survey of other related research are also included.
منابع مشابه
Z and HOL
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and rst order predicate logic and is typically used for human-readable formal speci cation. The HOL theorem proving system supports higher order logic and is used for machine-checked veri cation. A well-known case study is used as a running example. The presentation is ...
متن کاملCertifying Machine Code Safety: Shallow Versus Deep Embedding
We formalise a simple assembly language with procedures and a safety policy for arithmetic overflow in Isabelle/HOL. To verify individual programs we use a safety logic. Such a logic can be realised in Isabelle/HOL either as shallow or deep embedding. In a shallow embedding logical formulas are written as HOL predicates, whereas a deep embedding models formulas as a datatype. This paper present...
متن کاملA Structure Preserving Encoding of Z in Isabelle/HOL
We present a semantic representation of the core concepts of the specification language Z in higher-order logic. Although it is a "shallow embedding" like the one presented by Bowen and Gordon, our representation preserves the structure of a Z specification and avoids expanding Z schemas. The representation is implemented in the higherorder logic instance of the generic theorem prover Isabelle....
متن کاملIsomorphisms - A Link Between the Shallow and the Deep
We present a theory of isomorphisms between typed sets in Isabelle/HOL. Those isomorphisms can serve to link a shallow embedding with a theory that defines certain concepts directly in HOL. Thus, it becomes possible to use the advantage of a shallow embedding that it allows for efficient proofs about concrete terms of the embedded formalism with the advantage of a deeper theory that establishes...
متن کاملEmbedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol
In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z speciications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool for embedding formal notations and its use in automating an embedding of Z and AMN into the notations of P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information & Software Technology
دوره 37 شماره
صفحات -
تاریخ انتشار 1995